Linear Recurrent Sequences and Powers of a Square Matrix
نویسندگان
چکیده
In this paper, we establish a formula expressing explicitly the general term of a linear recurrent sequence, allowing us to generalize the original result of J. McLaughlin [7] concerning powers of a matrix of size 2, to the case of a square matrix of size m ≥ 2. Identities concerning Fibonacci and Stirling numbers and various combinatorial relations are derived.
منابع مشابه
On the powers of fuzzy neutrosophic soft matrices
In this paper, The powers of fuzzy neutrosophic soft square matrices (FNSSMs) under the operations $oplus(=max)$ and $otimes(=min)$ are studied. We show that the powers of a given FNSM stabilize if and only if its orbits stabilize for each starting fuzzy neutrosophic soft vector (FNSV) and prove a necessary and sufficient condition for this property using the associated graphs of the FNSM. ...
متن کاملTransformations computations: Power, Roots and Inverse
This paper presents some results of an annihilated element in Banach algebra, and in specific case, for any square matrix. The developed method significantly improves the computational aspects of transformations calculus and especially for finding powers and roots of any annihilated element. An example is given to compare the proposed method with some other methods to show the efficienc...
متن کاملUsing an Efficient Penalty Method for Solving Linear Least Square Problem with Nonlinear Constraints
In this paper, we use a penalty method for solving the linear least squares problem with nonlinear constraints. In each iteration of penalty methods for solving the problem, the calculation of projected Hessian matrix is required. Given that the objective function is linear least squares, projected Hessian matrix of the penalty function consists of two parts that the exact amount of a part of i...
متن کاملPositive solution of non-square fully Fuzzy linear system of equation in general form using least square method
In this paper, we propose the least-squares method for computing the positive solution of a $mtimes n$ fully fuzzy linear system (FFLS) of equations, where $m > n$, based on Kaffman's arithmetic operations on fuzzy numbers that introduced in [18]. First, we consider all elements of coefficient matrix are non-negative or non-positive. Also, we obtain 1-cut of the fuzzy number vector solution of ...
متن کاملOn the square root of quadratic matrices
Here we present a new approach to calculating the square root of a quadratic matrix. Actually, the purpose of this article is to show how the Cayley-Hamilton theorem may be used to determine an explicit formula for all the square roots of $2times 2$ matrices.
متن کامل